منابع مشابه
On Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملConcatenations with Binary Recurrent Sequences
Given positive integers A1, . . . , At and b ≥ 2, we write A1 · · ·At(b) for the integer whose base-b representation is the concatenation of the base-b representations of A1, . . . , At. In this paper, we prove that if (un)n≥0 is a binary recurrent sequence of integers satisfying some mild hypotheses, then for every fixed integer t ≥ 1, there are at most finitely many nonnegative integers n1, ....
متن کاملA Family of Fibonacci-like Conditional Sequences
Let {ai,j} be real numbers for 0 6 i 6 r 1 and 1 6 j 6 2, and define a sequence {vn} with initial conditions v0, v1 and conditional linear recurrence relation vn = at,1vn 1 + at,2vn 2 where n ⌘ t (mod r) (n > 2). The sequence {vn} can be viewed as a generalization of many well-known integer sequences, such as Fibonacci, Lucas, Pell, Jacobsthal, etc. We find explicitly a linear recurrence equati...
متن کاملTildeCRF: Conditional Random Fields for Logical Sequences
Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat alphabets. In this paper, we describe TildeCRF, the first method for training CRFs on logical sequences, i.e., sequences over an alphabet of logical atoms. TildeCRF’s key idea is to use relational regression trees in Dietterich e...
متن کاملTranslation Conditional Models for Protein Coding Sequences
A coding sequence is defined as a DNA sequence coding the primary structure of a protein (a polypeptide). Such a sequence must satisfy a specific constraint, which consists in coding a functional protein. As the genetic code is degenerated, there exists, for a given polypeptide, a set of synonymous sequences which would code the same polypeptide. Translation conditional models are being defined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 1991
ISSN: 0019-3577
DOI: 10.1016/0019-3577(91)90023-z